A cross-layer heuristic algorithm for addressing shadowing problem in optical attocell networks

The performance of visible light communication (VLC)-based optical attocell networks degrades due to shadowing caused by opaque objects. In order to improve reliability, we propose a cross-layer algorithm to find the optimal routing and resource allocation schemes when shadowing occurs. Simulation results show that the optimal scheme found by the proposed algorithm significantly improves the performance of optical attocell networks with one randomly shadowed link

Analysis of resource sharing in transparent networks

Transparent optical networking promises a cost-efficient solution for future core and metro networks because of the efficacy of switching high-granularity trunk traffic without opto-electronic conversion. Network availability is an important performance parameter for network operators, who are incorporating protection and restoration mechanisms in the network to achieve competitive advantages. This paper focuses on the reduction in Capital Expenditures (CapEx) expected from implementing sharing of backup resources in path-protected transparent networks. We dimension a nationwide network topology for different protection mechanisms using transparent and opaque architectures. We investigate the CapEx reductions obtained through protection sharing on a population of 1000 randomly generated biconnected planar topologies with 14 nodes. We show that the gain for transparent networks is heavily dependent on the offered load, with almost no relative gain for low load (no required parallel line systems). We also show that for opaque networks the CapEx reduction through protection sharing is independent of the traffic load and shows only a small dependency on the number of links in the network. The node CapEx reduction for high load (relative to the number of channels in a line system) is comparable to the CapEx reduction in opaque OTN systems. This is rather surprising as in OTN systems the number of transceivers and linecards and the size of the OTN switching matrix all decrease, while in transparent networks only the degree of the ROADM (number and size of WSSs in the node) decreases while the number of transponders remains the same

Dynamic accelerator provisioning for SSH tunnels in NFV environments

In this demonstration, we present dynamic allocation of accelerator resources to SSH tunnels in an NFV environment. In order to accelerate a VNF, its compute-intensive operations are offloaded to hardware cores running on an FPGA. The CPU utilization information of VNFs is continuously processed by a service management component to dynamically decide the suitable target to run VNF's crypto-operations. We also demonstrate switching between the non-accelerated and hardware-accelerated SSH-tunnels triggered by a change in the nature of the data traffic flowing through the tunnel and indicate throughput gains obtainable in dynamically switching contexts